The general Albertson irregularity index of graphs

<abstract><p>We introduce the general Albertson irregularity index of a connected graph $ G and define it as A_{p}(G) = (\sum_{uv\in E(G)}|d(u)-d(v)|^p)^{\frac{1}{p}} $, where p is positive real number d(v) degree vertex v in $. The new not only generalization well-known \sigma $-index, but also Minkowski norm vertex. We present lower upper bounds on index. In addition, we study extremal value for trees given order. Finally, give calculation formula generalized Bethe Kragujevac trees.</p></abstract>